Dyck Words, Lattice Paths, and Abelian Borders
نویسندگان
چکیده
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary given length with minimal abelian border length, tightening bound that from Christodoulakis et al. (Discrete Applied Mathematics, 2014). extend any distinct borders result Rampersad (Developments in Language Theory, 2013) no borders. also generalize these partial words.
منابع مشابه
Dyck Words, Lattice Paths, and Abelian Borders
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete Applied Mathematics, 2014). We also extend to any number of distinct abelian borders a result of Rampersad et al. (Developments in Language Theory, 2013) on th...
متن کاملCard Deals, Lattice Paths, Abelian Words and Combinatorial Identities
We give combinatorial interpretations of several related identities associated with the names Barrucand, Strehl and Franel, including one for the Apéry numbers, ∑n k=0 (n k )(n+k k ) ∑k j=0 (k j 3 = ∑n k=0 (n k )2(n+k k 2 . The combinatorial constructs employed are derangement-type card deals as introduced in a previous paper on Barrucand’s identity, labeled lattice paths and, following a comme...
متن کاملThe Phagocyte Lattice of Dyck Words
We introduce a new lattice structure on Dyck words. We exhibit efficient algorithms to compute meets and joins of Dyck words.
متن کاملDyck paths , Motzkin paths and traffic jams
It has recently been observed that the normalization of a one-dimensional out-of-equilibrium model, the asymmetric exclusion process (ASEP) with random sequential dynamics, is exactly equivalent to the partition function of a two-dimensional lattice path model of one-transit walks, or equivalently Dyck paths. This explains the applicability of the Lee–Yang theory of partition function zeros to ...
متن کاملOn Generalized Dyck Paths
We generalize the elegant bijective proof of the Chung Feller theorem from the paper of Young-Ming Chen [The Chung-Feller theorem revisited, Disc. Math. 308 (2008), 1328–1329].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2022
ISSN: ['1793-6373', '0129-0541']
DOI: https://doi.org/10.1142/s0129054122410027